Connectivity augmentation algorithms
نویسنده
چکیده
The main subject of the thesis is connectivity augmentation: we would like to make a given graph k-connected by adding a minimum number of new edges. There are four basic problems in this field, since one might consider both edgeand node-connectivity augmentation in both graphs and digraphs. The thesis wishes to contribute to three out of these four problems: directedand undirected node-connectivity and undirected edge-connectivity augmentation. Although directed edge-connectivity augmentation is not being considered, the last chapter is devoted to a constructive characterization result related to directed edge-connectivity. Let us summarize the main results of the thesis.
منابع مشابه
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
In the edge connectivity augmentation problem one wants to find an edge set of minimum total capacity that increases the edge connectivity of a given undirected graph by τ . It is a known non-trivial property of the edge connectivity augmentation problem that there is a sequence of edge sets E1, E2, . . . , such that ⋃ i≤τ Ei optmially increases the connectivity by τ , for any integer τ . The m...
متن کاملA Note on Eswaran and Tarjan's Algorithm for the Strong Connectivity Augmentation Problem
In a seminal paper Eswaran and Tarjan [1] introduced several augmentation problems and presented linear time algorithms for them. This paper points out an error in Eswaran and Tarjan's algorithm for the strong connectivity augmentation problem. Consequently, the application of their algorithm can result in a network that is not strongly connected. Luckily, the error can be fixed fairly easily, ...
متن کاملConnectivity augmentation problems in network design , in : Mathematical Programming : State ofthe
The problem of connectivity augmentation consists of nding a minimum cost of new edges to be added to a given graph so as to satisfy some prescribed connectivity requirements. This paper surveys cases when polynomial time algorithms and/or good characterizations are available for the minimum.
متن کاملGraph Algorithms for Network Connectivity Problems
This paper surveys the recent progress on the graph algorithms for solving network connectivity problems such as the extreme set problem, the cactus representation problem, the edge-connectivity augmentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings.
متن کامل